Confidence Set Inference With A Prior Quadratic Bound
نویسندگان
چکیده
منابع مشابه
Prior Elicitation, Assessment and Inference with a Dirichlet Prior
Methods are developed for eliciting a Dirichlet prior based upon stating bounds on the individual probabilities that hold with high prior probability. This approach to selecting a prior is applied to a contingency table problem where it is demonstrated how to assess the prior with respect to the bias it induces as well as how to check for prior-data conflict. It is shown that the assessment of ...
متن کاملEstimate Output of a Production Unit in Production Possibility Set with Fuzzy Inference Mechanism
In this paper, we consider the production possibility set with n production units such that the following four principles that governs: inclusion observations, conceivability, immensity and convexity. Our goal is to estimate the output of a same and new production unit with existing production possibility and amount of input is specified. So, initially we find the interval changes of each input...
متن کاملInference with the Median of a Prior
We consider the problem of inference on one of the two parameters of a probability distribution when we have some prior information on a nuisance parameter. When a prior probability distribution on this nuisance parameter is given, the marginal distribution is the classical tool to account for it. If the prior distribution is not given, but we have partial knowledge such as a fixed number of mo...
متن کاملSoftening a hard quadratic bound to a prior pdf — an example from geomagnetism
We discuss the problem of softening a hard quadratic bound to generate a personal prior probability distribution. The quadratic bound requires the model vector to live within a hyperspherical volume. Prior information suggests we may work in a finite-dimensional space, thus avoiding the known difficulties associated with infinite-dimensional spaces, and that values of the Euclidean 2-norm withi...
متن کاملAn Infeasible Active Set Method with Combinatorial Line Search for Convex Quadratic Problems with Bound Constraints∗
The minimization of a convex quadratic function under bound constraints is a fundamental building block for solving more complicated optimization problems. The active-set method introduced by Bergounioux et al. [1, 2] has turned out to be a powerful, fast and competitive approach for this problem. Hintermüller et al. [15] provide a theoretical explanation of its efficiency by interpreting it as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geophysical Journal International
سال: 1989
ISSN: 0956-540X,1365-246X
DOI: 10.1111/j.1365-246x.1989.tb00489.x